Simplicial Hochschild cochains as an Amitsur complex
نویسندگان
چکیده
منابع مشابه
The lattice path operad and Hochschild cochains
We introduce two coloured operads in sets – the lattice path operad and a cyclic extension of it – closely related to iterated loop spaces and to universal operations on cochains. As main application we present a formal construction of an E2-action (resp. framed E2-action) on the Hochschild cochain complex of an associative (resp. symmetric Frobenius) algebra.
متن کاملOperads of Natural Operations I: Lattice Paths, Braces and Hochschild Cochains
— In this first paper of a series we study various operads of natural operations on Hochschild cochains and relationships between them. Résumé (Opérades des opérations naturelles I: chemins brisés, opérations braces et cochaînes de Hochschild) Dans ce premier article d’une série nous étudions et comparons plusieurs opérades munies d’une action naturelle sur les cochaines de Hochschild d’une alg...
متن کاملLecture 5: Simplicial Complex 2-Manifolds, Simplex and Simplicial Complex
Figure 1: Two greatly different curves have a small Hausdroff distance Fréchet distance is a good similarity measurement for curves in Euclidean space. It can be simply described by a daily example. Suppose a dog and its owner are walking along two different paths (curves), connected by a leash. Both of them are moving continuously and forwards only, at any speed or even stop. Then length of th...
متن کاملComplexes 6 Simplicial complex
Definition 20 (simplex). A k-simplex σ is the convex hull of a set P of k + 1 affinely independent points. In particular, a 0-simplex is a vertex, a 1-simplex is an edge, a 2-simplex is a triangle, and a 3-simplex is a tetrahedron. A k-simplex is said to have dimension k. A face of σ is a simplex that is the convex hull of a nonempty subset of P. Faces of σ come in all dimensions from zero (σ’s...
متن کاملSimplicial Complex Entropy
We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices belonging to the same simplex are indistinguishable. We show that the proposed entropy function can be computed efficiently. By computing the entropy of several complices consisting of hundreds of simplices, we show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Generalized Lie Theory and Applications
سال: 2008
ISSN: 1736-5279,1736-4337
DOI: 10.4303/jglta/s080315